Digraph Polynomials for Counting Cycles and Paths
نویسنده
چکیده
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles and paths, respectively. They satisfy recurrence relations with respect to elementary edge or vertex operations. They are related to other polynomials and can also be generalized to the bivariate cycle polynomial, the bivariate path polynomial and the trivariate cycle-path polynomial. And a most general digraph polynomial satisfying such a linear recurrence relation is recursively defined and shown to be co-reducible to the trivariate cycle-path polynomial. We also give an explicit expression of this polynomial.
منابع مشابه
Directed graphs, 2D state models and characteristic polynomials of irreducible matrix pairs
In the paper the definition and main properties of a 2D-digraph, namely a directed graph with two kinds of arcs, are introduced. Under the assumption of strong connectedness, the analysis of its paths and cycles is performed, basing on an integer matrix whose rows represent the compositions of all circuits, and on the corresponding row-module. Natural constraints on the composition of the paths...
متن کاملCircular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials
We count the number of walks of length n on a k-node circular digraph that cover all k nodes in two ways. The first way illustrates the transfer-matrix method. The second involves counting various classes of height-restricted lattice paths. We observe that the results also count so-called k-balanced strings of length n, generalizing a 1996 Putnam problem. Corresponding Author This work was supp...
متن کاملCounting Problems Computationally Equivalent to Computing the Determinant
The main purpose of this paper is to exhibit non-algebraic problems that are computationally equivalent to computing the integer determinant. For this purpose, some graph-theoretic counting problems are shown to be equivalent to the integer determinant problem under suitable reducibilities. Those are the problems of counting the number of all paths between two nodes of a given acyclic digraph, ...
متن کاملMonochromatic kernel-perfectness of special classes of digraphs
A digraph D is said to be an m-coloured digraph, if its arcs are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. A set N ⊆ V (D) of vertices of D is said to be a kernel by monochromatic paths of the m-coloured digraph D, if it satisfies the two following properties: (1) N is independent by monochromatic paths; i.e., f...
متن کاملThe matrix cover polynomial
The cover polynomial C(D) = C(D;x, y) of a digraph D is a twovariable polynomial whose coefficients are determined by the number of vertex coverings of D by directed paths and cycles. Just as for the Tutte polynomial for undirected graphs (cf. [11, 16]), various properties of D can be read off from the values of C(D;x, y). For example, for an n-vertex digraph D, C(D; 1, 0) is the number of Hami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1712.00686 شماره
صفحات -
تاریخ انتشار 2017